Moving least-square reproducing kernel method Part II: Fourier analysis
نویسنده
چکیده
In Part I of this work, the moving least-square reproducing kernel (MLSRK) method is formulated and implemented. Based on its generic construction, an m-consistency structure is discovered and the convergence theorems are established. In this par\ of the work, a systematic Fourier analysis is employed to evaluate and further establish the method. The preliminary Fourier analysis reveals that the MLSRK method is stable for sufficiently dense, non-degenerated particle distribution, in the sense that the kernel function family satisfies the Riesz bound. One of the novelties of the current approach is to treat the MLSRK method as a variant of the ‘standard’ finite element method and depart from there to make a connection with the multiresolution approximation. In the spirits of multiresolution analysis, we propose the following MLSRK transformation.
منابع مشابه
Moving Least Square Reproducing Kernel Method ( III ) : Wavelet Packet & Its
This work is a natural extension of the work done in Part II of this series. A new partition of unity | the synchronized reproducing kernel (SRK) interpolant|is proposed within the framework of moving least square reproducing kernel representation. It is a further development and generalization of the reproducing kernel particle method (RKPM), which demonstrates some superior computational capa...
متن کاملMoving least-square reproducing kernel methods (I) Methodology and convergence
This paper formulates the moving least-square interpolation scheme in a framework of the so-called moving least-square reproducing kernel (MLSRK) representation. In this study, the procedure of constructing moving least square interpolation function is facilitated by using the notion of reproducing kernel formulation, which, ‘as a generalization of the early discrete approach, establishes a con...
متن کاملThe solving linear one-dimemsional Volterra integral equations of the second kind in reproducing kernel space
In this paper, to solve a linear one-dimensional Volterra integral equation of the second kind. For this purpose using the equation form, we have defined a linear transformation and by using it's conjugate and reproducing kernel functions, we obtain a basis for the functions space.Then we obtain the solution of integral equation in terms of the basis functions. The examples presented in this ...
متن کاملReproducing Kernel Hilbert Spaces in Learning Theory: the Sphere and the Hypercube
We analyze the regularized least square algorithm in learning theory with Reproducing Kernel Hilbert Spaces (RKHS). Explicit convergence rates for the regression and binary classification problems are obtained in particular for the polynomial and Gaussian kernels on the n-dimensional sphere and the hypercube. There are two major ingredients in our approach: (i) a law of large numbers for Hilber...
متن کاملA New Approach for Solving Volterra Integral Equations Using The Reproducing Kernel Method
This paper is concerned with a technique for solving Volterra integral equations in the reproducing kernel Hilbert space. In contrast with the conventional reproducing kernel method, the Gram-Schmidt process is omitted here and satisfactory results are obtained.The analytical solution is represented in the form of series.An iterative method is given to obtain the approximate solution.The conver...
متن کامل